﻿#define _CRT_SECURE_NO_WARNINGS
#include "ConcurrentAlloc.hpp"
#include <atomic>
#include <iostream> // 添加必要的头文件

void BenchmarkMalloc(size_t ntimes, size_t nworks, size_t rounds)
{
    std::vector<std::thread> vthread(nworks);
    std::atomic<size_t> malloc_costtime = 0;
    std::atomic<size_t> free_costtime = 0;

    for (size_t k = 0; k < nworks; ++k)
    {
        vthread[k] = std::thread([&, k]() {
            std::vector<void*> v;
            v.reserve(ntimes);

            for (size_t j = 0; j < rounds; ++j)
            {
                size_t begin1 = clock();
                for (size_t i = 0; i < ntimes; i++)
                {
                    v.push_back(malloc(16));
                }
                size_t end1 = clock();

                size_t begin2 = clock();
                for (size_t i = 0; i < ntimes; i++)
                {
                    free(v[i]);
                }
                size_t end2 = clock();
                v.clear();

                malloc_costtime += (end1 - begin1);
                free_costtime += (end2 - begin2);
            }
            });
    }

    for (auto& t : vthread)
    {
        t.join();
    }

    // 使用 load() 获取原子变量的值，并强制转换为 unsigned int
    printf("%u个线程并发执行%u轮次，每轮次malloc %u次: 花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)rounds, (unsigned int)ntimes, (unsigned int)malloc_costtime.load());

    printf("%u个线程并发执行%u轮次，每轮次free %u次: 花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)rounds, (unsigned int)ntimes, (unsigned int)free_costtime.load());

    printf("%u个线程并发malloc&free %u次，总计花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)(nworks * rounds * ntimes),
        (unsigned int)(malloc_costtime.load() + free_costtime.load()));
}

void BenchmarkConcurrentMalloc(size_t ntimes, size_t nworks, size_t rounds)
{
    std::vector<std::thread> vthread(nworks);
    std::atomic<size_t> malloc_costtime = 0;
    std::atomic<size_t> free_costtime = 0;

    for (size_t k = 0; k < nworks; ++k)
    {
        vthread[k] = std::thread([&]() {
            std::vector<void*> v;
            v.reserve(ntimes);

            for (size_t j = 0; j < rounds; ++j)
            {
                size_t begin1 = clock();
                for (size_t i = 0; i < ntimes; i++)
                {
                    //v.push_back(ConcurrentAlloc(16));
                    v.push_back(ConcurrentAlloc((16+i)%8192+1));
                }
                size_t end1 = clock();

                size_t begin2 = clock();
                for (size_t i = 0; i < ntimes; i++)
                {
                    ConcurrentFree(v[i]);
                }
                size_t end2 = clock();
                v.clear();

                malloc_costtime += (end1 - begin1);
                free_costtime += (end2 - begin2);
            }
            });
    }

    for (auto& t : vthread)
    {
        t.join();
    }

    printf("%u个线程并发执行%u轮次，每轮次concurrent alloc %u次: 花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)rounds, (unsigned int)ntimes, (unsigned int)malloc_costtime.load());

    printf("%u个线程并发执行%u轮次，每轮次concurrent dealloc %u次: 花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)rounds, (unsigned int)ntimes, (unsigned int)free_costtime.load());

    printf("%u个线程并发concurrent alloc&dealloc %u次，总计花费：%u ms\n",
        (unsigned int)nworks, (unsigned int)(nworks * rounds * ntimes),
        (unsigned int)(malloc_costtime.load() + free_costtime.load()));
}

int main()
{
    size_t n = 10000;
    std::cout << "==========================================================\n";
    BenchmarkConcurrentMalloc(n, 4, 10);
    std::cout << "\n\n";

    BenchmarkMalloc(n, 4, 10);
    std::cout << "==========================================================\n";

    return 0;
}